from collections import defaultdict, deque
import sys
input = lambda : sys.stdin.readline().strip()
md=1000000007
md2=998244353
mx=1000000000
mx2=int(1e18)
for t in range(int(input())):
x=int(input())
s = input()
l=1
while len(s) < x:
s = s + (s[l:]*(int(s[l-1])-1))
l += 1
ms = len(s)
while l <= x:
ms = (ms-l)*(int(s[l-1]))+l
ms %= md
l+=1
print(ms)#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<< #x <<" : "<<(x)<<endl;
#define dbgv(v) cout<< #v <<" : ";for(auto &i:v) cout<<(i)<<" ";cout<<endl;
const int MOD = 1e9+7;
void solve()
// int solve()
{
int x;cin>>x;
string s;cin>>s;
int n = s.size();
int i = 0;
while(s.size() < x){
string t = s.substr(i+1,s.size() - i -1);
for(int j=0;j<(s[i]-'1');j++)
s += t;
i++;
}
int ans = n;
for(int i=1;i<=x;i++)
{
int ad = ((ans-i)*(s[i-1]-'1'))%MOD;
(ans += ad)%=MOD;
}
(ans+=MOD)%=MOD;
cout<<ans<<endl;
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin>>t;
while(t--)
{
solve();
// cout<<solve()<<endl;
}
return 0;
}561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |